On a smoothed penalty-based algorithm for global optimization
نویسندگان
چکیده
منابع مشابه
Elite Opposition-based Artificial Bee Colony Algorithm for Global Optimization
Numerous problems in engineering and science can be converted into optimization problems. Artificial bee colony (ABC) algorithm is a newly developed stochastic optimization algorithm and has been widely used in many areas. However, due to the stochastic characteristics of its solution search equation, the traditional ABC algorithm often suffers from poor exploitation. Aiming at this weakness o...
متن کاملA Derivative-Free Algorithm for Constrained Global Optimization Based on Exact Penalty Functions
Constrained global optimization problems can be tackled by using exact penalty approaches. In a preceding paper, we proposed an exact penalty algorithm for constrained problems which combines an unconstrained global minimization technique for minimizing a non-differentiable exact penalty function for given values of the penalty parameter, and an automatic updating of the penalty parameter that ...
متن کاملImproved Cuckoo Search Algorithm for Global Optimization
The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...
متن کاملSmoothed penalty algorithms for optimization of nonlinear models
We introduce an algorithm for solving nonlinear optimization problems with general equality and box constraints. The proposed algorithm is based on smoothing of the exact l1−penalty function and solving the resulting problem by any box-constraint optimization method. We introduce a general algorithm and present theoretical results for updating the penalty and smoothing parameter. We apply the a...
متن کاملSmoothed Lower Order Penalty Function for Constrained Optimization Problems
The paper introduces a smoothing method to the lower order penalty function for constrained optimization problems. It is shown that, under some mild conditions, an optimal solution of the smoothed penalty problem is an approximate optimal solution of the original problem. Based on the smoothed penalty function, an algorithm is presented and its convergence is proved under some mild assumptions....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2017
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-017-0504-2